Termination w.r.t. Q proof of TRS/Ste92perfect.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

perfectp₁(0) -> false
perfectp₁(s₁(x)) -> f₄(x, s₁(0), s₁(x), s₁(x))
f₄(0, y, 0, u) -> true
f₄(0, y, s₁(z), u) -> false
f₄(s₁(x), 0, z, u) -> f₄(x, u, minus₂(z, s₁(x)), u)
f₄(s₁(x), s₁(y), z, u) -> if₃(le₂(x, y), f₄(s₁(x), minus₂(y, x), z, u), f₄(x, u, z, u))

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

perfectp₁(0) -> false
perfectp₁(s₁(x)) -> f₄(x, s₁(0), s₁(x), s₁(x))
f₄(0, y, 0, u) -> true
f₄(0, y, s₁(z), u) -> false
f₄(s₁(x), 0, z, u) -> f₄(x, u, minus₂(z, s₁(x)), u)
f₄(s₁(x), s₁(y), z, u) -> if₃(le₂(x, y), f₄(s₁(x), minus₂(y, x), z, u), f₄(x, u, z, u))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

F₄(s₁(x), s₁(y), z, u) -> F₄(s₁(x), minus₂(y, x), z, u)
F₄(s₁(x), s₁(y), z, u) -> F₄(x, u, z, u)
PERFECTP₁(s₁(x)) -> F₄(x, s₁(0), s₁(x), s₁(x))
F₄(s₁(x), 0, z, u) -> F₄(x, u, minus₂(z, s₁(x)), u)

The TRS R consists of the following rules:

perfectp₁(0) -> false
perfectp₁(s₁(x)) -> f₄(x, s₁(0), s₁(x), s₁(x))
f₄(0, y, 0, u) -> true
f₄(0, y, s₁(z), u) -> false
f₄(s₁(x), 0, z, u) -> f₄(x, u, minus₂(z, s₁(x)), u)
f₄(s₁(x), s₁(y), z, u) -> if₃(le₂(x, y), f₄(s₁(x), minus₂(y, x), z, u), f₄(x, u, z, u))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

F₄(s₁(x), s₁(y), z, u) -> F₄(s₁(x), minus₂(y, x), z, u)
F₄(s₁(x), s₁(y), z, u) -> F₄(x, u, z, u)
PERFECTP₁(s₁(x)) -> F₄(x, s₁(0), s₁(x), s₁(x))
F₄(s₁(x), 0, z, u) -> F₄(x, u, minus₂(z, s₁(x)), u)

The TRS R consists of the following rules:

perfectp₁(0) -> false
perfectp₁(s₁(x)) -> f₄(x, s₁(0), s₁(x), s₁(x))
f₄(0, y, 0, u) -> true
f₄(0, y, s₁(z), u) -> false
f₄(s₁(x), 0, z, u) -> f₄(x, u, minus₂(z, s₁(x)), u)
f₄(s₁(x), s₁(y), z, u) -> if₃(le₂(x, y), f₄(s₁(x), minus₂(y, x), z, u), f₄(x, u, z, u))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 1 SCC with 2 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

F₄(s₁(x), s₁(y), z, u) -> F₄(x, u, z, u)
F₄(s₁(x), 0, z, u) -> F₄(x, u, minus₂(z, s₁(x)), u)

The TRS R consists of the following rules:

perfectp₁(0) -> false
perfectp₁(s₁(x)) -> f₄(x, s₁(0), s₁(x), s₁(x))
f₄(0, y, 0, u) -> true
f₄(0, y, s₁(z), u) -> false
f₄(s₁(x), 0, z, u) -> f₄(x, u, minus₂(z, s₁(x)), u)
f₄(s₁(x), s₁(y), z, u) -> if₃(le₂(x, y), f₄(s₁(x), minus₂(y, x), z, u), f₄(x, u, z, u))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

F₄(s₁(x), s₁(y), z, u) -> F₄(x, u, z, u)
F₄(s₁(x), 0, z, u) -> F₄(x, u, minus₂(z, s₁(x)), u)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(0) = 0
POL(F₄(x₁, x₂, x₃, x₄)) = 3·x₁ + x₃
POL(minus₂(x₁, x₂)) = 2
POL(s₁(x₁)) = 3 + x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

perfectp₁(0) -> false
perfectp₁(s₁(x)) -> f₄(x, s₁(0), s₁(x), s₁(x))
f₄(0, y, 0, u) -> true
f₄(0, y, s₁(z), u) -> false
f₄(s₁(x), 0, z, u) -> f₄(x, u, minus₂(z, s₁(x)), u)
f₄(s₁(x), s₁(y), z, u) -> if₃(le₂(x, y), f₄(s₁(x), minus₂(y, x), z, u), f₄(x, u, z, u))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.